A Reliability Level List based SDD Algorithm for Binary Cyclic Block Codes
نویسندگان
چکیده
منابع مشابه
A Recursive Log-MAP Algorithm for Binary Linear Block Codes
| An e cient recursive Log-MAP algorithm for binary linear block codes is proposed. This algorithm is devised based on the structural properties of the minimal trellis diagram. Simulation results show that for some well known codes, the proposed algorithm reduces decoding complexity signi cantly compared to the conventional Log-MAP algorithm.
متن کاملOrder Statistics Based List Decoding Techniques for Linear Binary Block Codes
The order statistics based list decoding techniques for linear binary block codes of small to medium block length are investigated. The construction of the list of the test error patterns is considered. The original order statistics decoding is generalized by assuming segmentation of the most reliable independent positions of the received bits. The segmentation is shown to overcome several draw...
متن کاملOrdered statistics-based list decoding techniques for linear binary block codes
The ordered statistics-based list decoding techniques for linear binary block codes of small to medium block length are investigated. The construction of a list of the test error patterns is considered. The original ordered-statistics decoding (OSD) is generalized by assuming segmentation of the most reliable independent positions (MRIPs) of the received bits. The segmentation is shown to overc...
متن کاملList decoding of binary codes
We briefly survey some recent progress on list decoding algorithms for binary codes. The results discussed include: – Algorithms to list decode binary Reed-Muller codes of any order up to the minimum distance, generalizing the classical GoldreichLevin algorithm for RM codes of order 1 (Hadamard codes). These algorithms are “local” and run in time polynomial in the message length. – Construction...
متن کاملList Decoding for Binary Goppa Codes
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n− p n(n− 2t− 2) errors in a length-n classical irreducible degree-t binary Goppa code. Compared to the best previous polynomialtime list-decoding algorithms for the same codes, the new algorithm corrects approximately t/2n extra errors.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2014
ISSN: 1841-9844,1841-9836
DOI: 10.15837/ijccc.2012.2.1418